SEQUENTIAL METAHEURISTICS FOR PRIORITY PACKAGING PROBLEM WITH INCOMPATIBLE CATEGORIES
نویسندگان
چکیده
منابع مشابه
Metaheuristics for the vehicle routing problem with loading constraints
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is motivated by a real-world transportation problem occurring to a wood-products retailer, which delivers its products to a number of customers in a specific region. We solve the problem by means of two different metaheurist...
متن کاملEvolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority
A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...
متن کاملModern Metaheuristics for Function Optimization Problem
This paper compares the behaviour of three metaheuristics for the function optimization problem on a set of classical functions handling a large number of variables and known to be hard. The first algorithm to be described is Particle Swarm Optimization (PSO). The second one is based on the paradigm of Artificial Immune System (AIS). Both algorithms are then compared with a Genetic Algorithm (G...
متن کاملMetaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathematical programming formulation and simple metaheuristics for solving it. The formulation is based on a transformation of the input data, in such a way that a standard mathematical programming model for the Asymmetric Tr...
متن کاملHybrid Metaheuristics for the Graph Partitioning Problem
The Graph Partitioning Problem (GPP) is one of the most studied NPcomplete problems notable for its broad spectrum of applicability such as in VLSI design, data mining, image segmentation, etc. Due to its high computational complexity, a large number of approximate approaches have been reported in the literature. Hybrid algorithms that are based on adaptations of popular metaheuristic technique...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Современные наукоемкие технологии (Modern High Technologies)
سال: 2020
ISSN: 1812-7320
DOI: 10.17513/snt.38096